Invariants of the length spectrum and spectral invariants of planar convex domains
نویسندگان
چکیده
منابع مشابه
Affine invariants of convex polygons
In this correspondence, we prove that the affine invariants, for image registration and object recognition, proposed recently by Yang and Cohen (see ibid., vol.8, no.7, p.934-46, July 1999) are algebraically dependent. We show how to select an independent and complete set of the invariants. The use of this new set leads to a significant reduction of the computing complexity without decreasing t...
متن کاملRigidity and Polynomial Invariants of Convex Polytopes
We present an algebraic approach to the classical problem of constructing a simplicial convex polytope given its planar triangulation and lengths of its edges. We introduce polynomial invariants of a polytope and show that they satisfy polynomial relations in terms of squares of edge lengths. We obtain sharp upper and lower bounds on the degree of these polynomial relations. In a special case o...
متن کاملON THE USE OF KULSHAMMER TYPE INVARIANTS IN REPRESENTATION THEORY
Since 2005 a new powerful invariant of an algebra has emerged using the earlier work of Horvath, Hethelyi, Kulshammer and Murray. The authors studied Morita invariance of a sequence of ideals of the center of a nite dimensional algebra over a eld of nite characteristic. It was shown that the sequence of ideals is actually a derived invariant, and most recently a slightly modied version o...
متن کاملConvex Graph Invariants ∗ Venkat Chandrasekaran
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants that are convex functions of the adjacency matrix of a graph. Some examples include functions of a graph such as the maximum degree, the MAXCUT value (and it...
متن کاملConvex invariants in multipartite tournaments
In the study of convexity spaces, the most common convex invariants are based on notions of independence with respect to taking convex hulls. In [D.B. Parker, R.F. Westhoff and M.J. Wolf, Discuss. Math. Graph Theory 29 (2009), 51–69], H-independence, R-independence and convex independence were studied to prove results about the Helly number, Radon number and rank of a clone-free multipartite to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 1994
ISSN: 0010-3616,1432-0916
DOI: 10.1007/bf02099782